Cavity approach to the spectral density of sparse symmetric random matrices.

نویسندگان

  • Tim Rogers
  • Isaac Pérez Castillo
  • Reimer Kühn
  • Koujin Takeda
چکیده

The spectral density of various ensembles of sparse symmetric random matrices is analyzed using the cavity method. We consider two cases: matrices whose associated graphs are locally treelike, and sparse covariance matrices. We derive a closed set of equations from which the density of eigenvalues can be efficiently calculated. Within this approach, the Wigner semicircle law for Gaussian matrices and the Marcenko-Pastur law for covariance matrices are recovered easily. Our results are compared with numerical diagonalization, showing excellent agreement.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cavity approach to the spectral density of non-Hermitian sparse matrices.

The spectral densities of ensembles of non-Hermitian sparse random matrices are analyzed using the cavity method. We present a set of equations from which the spectral density of a given ensemble can be efficiently and exactly calculated. Within this approach, the generalized Girko's law is recovered easily. We compare our results with direct diagonalisation for a number of random matrix ensemb...

متن کامل

Spectra of sparse random matrices

We compute the spectral density for ensembles of of sparse symmetric random matrices using replica. Our formulation of the replica-symmetric ansatz shares the symmetries of the one suggested in a seminal paper by Rodgers and Bray (symmetry with respect to permutation of replica and rotation symmetry in the space of replica), but uses a different representation in terms of superpositions of Gaus...

متن کامل

Spectral density of the non-backtracking operator

The non-backtracking operator was recently shown to provide a significant improvement when used for spectral clustering of sparse networks. In this paper we analyze its spectral density on large random sparse graphs using a mapping to the correlation functions of a certain interacting quantum disordered system on the graph. On sparse, tree-like graphs, this can be solved efficiently by the cavi...

متن کامل

A New Dictionary Construction Method in Sparse Representation Techniques for Target Detection in Hyperspectral Imagery

Hyperspectral data in Remote Sensing which have been gathered with efficient spectral resolution (about 10 nanometer) contain a plethora of spectral bands (roughly 200 bands). Since precious information about the spectral features of target materials can be extracted from these data, they have been used exclusively in hyperspectral target detection. One of the problem associated with the detect...

متن کامل

The Limiting Spectral Measure for the Ensemble of Generalized Real Symmetric Block m-Circulant Matrices

Given an ensemble of N × N random matrices with independent entries chosen from a nice probability distribution, a natural question is whether the empirical spectral measures of typical matrices converge to some limiting measure as N → ∞. It has been shown that the limiting spectral distribution for the ensemble of real symmetric matrices is a semi-circle, and that the distribution for real sym...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 78 3 Pt 1  شماره 

صفحات  -

تاریخ انتشار 2008